/*
 * Problem:
 * Given a string and an offset, rotate string by offset. (rotate from left to right)
 * 给定一个字符串和一个偏移量，根据偏移量旋转字符串（从左到右）
 * 
 * 
 * Example:
 * Given "abcdefg".
 * 给定 "abcdefg"
 * offset=0 => "abcdefg"
 * offset=1 => "gabcdef"
 * offset=2 => "fgabcde"
 * offset=3 => "efgabcd"
 * 
 * Challenge:
 * Rotate in-place with O(1) extra memory.
 * 在O(1)的空间复杂度内旋转字符串
 */
package me.yobol.lintcode.easy.rotatestring;

/**
 *
 * @author Yobol
 */
public interface IRotateString {
    
    public char[] rotateString(char [] str,int offset);
}
